Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
نویسندگان
چکیده
منابع مشابه
Rectilinear Convex Hull with Minimum Area
Let P be a set of n points in the plane. We solve the problem of computing the orientations for which the rectilinear convex hull of P has minimum area in optimal ⇥(n log n) time and O(n) space. Introduction The interest in the rectilinear convex hull of planar point sets arises from the study of ortho-convexity [10], a relaxation of traditional convexity. Unlike convex regions, an ortho-convex...
متن کاملRectilinear and O-convex hull with minimum area
Let P be a set of n points in the plane and O be a set of k lines passing through the origin. We show: (1) How to compute the O-hull of P in Θ(n log n) time and O(n) space, (2) how to compute and maintain the rotated hull OHθ(P ) for θ ∈ [0, 2π) in O(kn log n) time and O(kn) space, and (3) how to compute in Θ(n log n) time and O(n) space a value of θ for which the rectilinear convex hull, RHθ(P...
متن کاملComputing minimum-area rectilinear convex hull and L-shape
Article history: Received 21 February 2008 Accepted 24 February 2009 Available online 24 March 2009 Communicated by T. Asano
متن کاملGPU accelerated convex hull computation
We present a hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away many of the points that do not lie on the boundary. The convex hull of remaining points is computed on a CPU. The GPU-based filter proceeds in an incremental manner and computes a pseudo-hull that is contained inside the co...
متن کاملRectilinear Trees under Rotation and Related Problems
We onsider the problem of nding a minimum spanning tree for a set of points in the plane where the orientations of edges are restri ted to uniformly distributed orientations, = 2; 3; 4; : : :, and where the oordinate system an be rotated around the origo by an arbitrary angle. The most important ase with appli ations in VLSI design arises when = 2; in this, soalled re tilinear ase, the edges ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2020
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-020-00953-5